/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 110000;
ll a[maxn], b[maxn];
ll dp1[maxn], dp2[maxn], ans;
bool vis[maxn];
ll n;

void dfs(ll id)
{
}

int main()
{
    IOS;
    ll t;
    cin >> t;
    while (t--)
    {
        cin >> n;
        ans = 0;
        for (ll i = 1; i <= n; i++)
        {
            vis[i] = false;
            dp1[i] = 0;
            dp2[i] = 0;
        }
        for (ll i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        for (ll i = 1; i <= n; i++)
        {
            cin >> b[i];
        }
    }
    getchar();
    getchar();
    return 0;
}
